Tunnelling Crossover Networks for the Asymmetric TSP
نویسندگان
چکیده
Local optima networks are a compact representation of fitness landscapes that can be used for analysis and visualisation. This paper provides the first analysis of the Asymmetric Travelling Salesman Problem using local optima networks. These are generated by sampling the search space by recording the progress of an existing evolutionary algorithm based on the Generalised Asymmetric Partition Crossover. They are compared to networks sampled through the Chained Lin-Kernighan heuristic across 25 instances. Structural differences and similarities are identified, as well as examples where crossover smooths the landscape.
منابع مشابه
AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملLogarithmic Bounds on an Algorithm for Asymmetric TSP
In 1982 Frieze, Galbiati and Maffioli (Networks 12:23-39) published their famous algorithm for approximating the TSP tour in an asymmetric graph with triangle inequality. They show that the algorithm approximates the TSP tour within a factor of log 2 n. We construct a family of graphs for which the algorithm (with some implementation details specified by us) gives an approximation which is log ...
متن کاملAsparagos96 and the Traveling Salesman Problem
| This paper describes a spatially structured evolutionary algorithm being applied to the symmetric and asymmetric traveling salesman problem (TSP). This approach shows that a genetic algorithm with high degree of isolation-by-distance in combination with a simple repairing mechanism is able to nd high quality solutions for the TSP. The evolutionary part of the algorithm presented diiers from t...
متن کاملTheory and Methodology Construction heuristics for the asymmetric TSP
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. This state of aairs is at odds with the fact that asymmetric models are relevant to a wider range of applications, and indeed are un...
متن کاملConstruction heuristics for the asymmetric TSP
Non Euclidean TSP construction heuristics and especially asymmetric TSP construc tion heuristics have been neglected in the literature by comparison with the extensive e orts devoted to studying Euclidean TSP construction heuristics This state of a airs is at odds with the fact that asymmetric models are relevant to a wider range of applica tions and indeed are uniformly more general that symme...
متن کامل